Quadratic programming over ellipsoids with applications to constrained linear regression and tensor decomposition
نویسندگان
چکیده
منابع مشابه
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and principal minors PSD cuts. Computational results based on instances from the literature are presented.
متن کاملP , Sequential Quadratic Constrained Quadratic Programming
We follow the popular approach for unconstrained minimization, i.e. we develop a local quadratic model at a current approximate minimizer in conjunction with a trust region. We then minimize this local model in order to nd the next approximate minimizer. Asymptot-ically, nding the local minimizer of the quadratic model is equivalent to applying Newton's method to the stationarity condition. For...
متن کاملFast and robust tensor decomposition with applications to dictionary learning
We develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-squares (SOS) semidefinite programming hierarchy. Our algorithms can decompose a 4-tensor with n-dimensional orthonormal components in the presence of error with constant spectral norm (when viewed as an n2-by-n2 matr...
متن کاملMultiparametric Linear and Quadratic Programming
In this work we present an algorithm for the solution of multiparametric linear and quadratic programming problems.With linear constraints and linear or convex quadratic objective functions, the optimal solution of these optimization problems is given by a conditional piecewise linear function of the varying parameters. This function results from first-order estimations of the analytical nonlin...
متن کاملComplex Matrix Decomposition and Quadratic Programming
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over specific domains in the complex space. In its real case analog, such studies were conducted in Sturm and Zhang [11]. In this paper it is shown that stronger results can be obtained for the complex Hermitian case. In part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computing and Applications
سال: 2019
ISSN: 0941-0643,1433-3058
DOI: 10.1007/s00521-019-04191-z